A search for Wieferich and Wilson primes

نویسندگان

  • Richard E. Crandall
  • Karl Dilcher
  • Carl Pomerance
چکیده

An odd prime p is called a Wieferich prime if 2p−1 ≡ 1 (mod p); alternatively, a Wilson prime if (p− 1)! ≡ −1 (mod p). To date, the only known Wieferich primes are p = 1093 and 3511, while the only known Wilson primes are p = 5, 13, and 563. We report that there exist no new Wieferich primes p < 4×1012 , and no new Wilson primes p < 5×108. It is elementary that both defining congruences above hold merely (mod p), and it is sometimes estimated on heuristic grounds that the “probability” that p is Wieferich (independently: that p is Wilson) is about 1/p. We provide some statistical data relevant to occurrences of small values of the pertinent Fermat and Wilson quotients (mod p).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Wieferich Prime Search up to 6 . 7 × 10 15

A Wieferich prime is a prime p such that 2p−1 ≡ 1 (mod p2). Despite several intensive searches, only two Wieferich primes are known: p = 1093 and p = 3511. This paper describes a new search algorithm for Wieferich primes using double-precision Montgomery arithmetic and a memoryless sieve, which runs significantly faster than previously published algorithms, allowing us to report that there are ...

متن کامل

The continuing search for Wieferich primes

A prime p satisfying the congruence 2p−1 ≡ 1 (mod p) is called a Wieferich prime. Although the number of Wieferich primes is believed to be infinite, the only ones that have been discovered so far are 1093 and 3511. This paper describes a search for further solutions. The search was conducted via a large scale Internet based computation. The result that there are no new Wieferich primes less th...

متن کامل

A search for Fibonacci-Wieferich and Wolstenholme primes

A prime p is called a Fibonacci-Wieferich prime if Fp−( p5 ) ≡ 0 (mod p2), where Fn is the nth Fibonacci number. We report that there exist no such primes p < 2 × 1014. A prime p is called a Wolstenholme prime if (2p−1 p−1 ) ≡ 1 (mod p4). To date the only known Wolstenholme primes are 16843 and 2124679. We report that there exist no new Wolstenholme primes p < 109. Wolstenholme, in 1862, proved...

متن کامل

Estimates for Wieferich Numbers

We define Wieferich numbers to be those odd integers w ≥ 3 that satisfy the congruence 2φ(w) ≡ 1 (mod w2). It is clear that the distribution of Wieferich numbers is closely related to the distribution of Wieferich primes, and we give some quantitative forms of this statement. We establish several unconditional asymptotic results about Wieferich numbers; analogous results for the set of Wieferic...

متن کامل

Overpseudoprimes, Mersenne Numbers and Wieferich Primes

We introduce a new class of pseudoprimes-so called ”overpseudoprimes” which is a special subclass of super-Poulet pseudoprimes. Denoting via h(n) the multiplicative order of 2 modulo n,we show that odd number n is overpseudoprime if and only if the value of h(n) is invariant of all divisors d > 1 of n. In particular, we prove that all composite Mersenne numbers 2 − 1, where p is prime, and squa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 66  شماره 

صفحات  -

تاریخ انتشار 1997